Clustering of Conceptual Graphs with Sparse Data
نویسندگان
چکیده
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner through the concept of stereotype, based on the notion of default generalization. The cognitive model we propose relies on sets of stereotypes and makes it possible to save data in a structured memory.
منابع مشابه
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data described with conceptual graphs. The induction engine is based on a non-supervised algorithm named default clustering which uses the concept of stereotype and the new notion of default subsumption, the latter being inspir...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملMining at Detail Level Using Conceptual Graphs *
Text mining is defined as knowledge discovery in large text collections. It detects interesting patterns such as clusters, associations, deviations, similarities, and differences in sets of texts. Current text mining methods use simplistic representations of text contents, such as keyword vectors, which imply serious limitations on the kind and meaningfulness of possible discoveries. We show ho...
متن کاملSparse Clustering for Probability Un-Weighted Graphs Mining
-Probabilistic graphs have significant importance in data mining. The correlations endure amid the adjacent edges in different probabilistic graphs. Graph clustering is used in exploratory data analysis at data compression, information retrieval and image segmentation. The existing work presented a Partially Expected Edit Distance Reduction (PEEDR) and Correlated Probabilistic Graphs Spectral (...
متن کاملInferring Metaphoric Structure from Financial Articles Using Bayesian Sparse Models
Drawing from a large corpus (17,000+ articles) of financial news, we perform a Bayesian sparse model analysis of the argument-distributions of the UP and DOWN-verbs, used to describe movements in indices, stocks and shares. Previous work, by Gerow and Keane (2011a, 2011b, 2011c), has shown, using measures of overlap and k-means clustering, that metaphor hierarchies and antonymic relations can b...
متن کامل